#include"BinarySearchTree.h"
int main()
{
	int a[] = { 8,3,1,10,1,6,4,7,14,13 };
	BSTree<int> t1;
	for (auto e : a)
	{
		t1.Insert(e);
	}
	t1.Inorder();
	t1.erase(10);
	t1.Inorder();
}